We are interested in fundamental limits to computation imposed by physical constraints. In particular, the physical laws of motion constrain the speed at which a computer can transition between well-defined states. He...
详细信息
ISBN:
(纸本)9783642390746;9783642390739
We are interested in fundamental limits to computation imposed by physical constraints. In particular, the physical laws of motion constrain the speed at which a computer can transition between well-defined states. Here, we discuss speed limits in the context of quantum computing. We derive some results in the familiar representation, then demonstrate that the same results may be derived more readily by transforming the problem description into an alternative representation. this transformed approach is more readily extended to time-dependent and constrained systems. We demonstrate the approach applied to a spin chain system.
the problem of metrical service systems with multiple servers ((k,l)-MSSMS) proposed by Feuerstein [16] is to service requests, each of which is an l-point subset of a metric space, using k servers in an online manner...
详细信息
the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set Programming and Abductive Reasoning, Semantics, Constraints and Logic Programming, Answer-Set Programm...
ISBN:
(纸本)9783642415234
the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set Programming and Abductive Reasoning, Semantics, Constraints and Logic Programming, Answer-Set Programming and Model Expansion and WLP System Descriptions. the topics include: the IMPL policy language for managing inconsistency in multi-context systems;the parameterized complexity of constraint satisfaction and reasoning;translating nondeterministic functional language based on attribute grammars into java;sensitivity analysis for declarative relational query languages with ordinal ranks;a uniform fixpoint approach to the implementation of inference methods for deductive databases;translating answer-set programs into bit-vector logic;making use of advances in answer-set programming for abstract argumentation systems;confidentiality-preserving publishing of EDPs for credulous and skeptical users;every formula-based logic program has a least infinite-valued model;descriptive approach to preferred answer sets;solving modular model expansion: case studies;a constraint-based interactive product configurator;HEX-programs with nested program calls;a prototype of a knowledge-based programming environment;an IDE for answer-set programming-preliminary report;a system for visualising and visual editing of interpretations for answer-set programsa and unit testing in ASPIDE.
We present a prototype refactoring framework based on graph rewriting and bidirectional transformations that is designed to be generic, extensible, and declarative. Our approach uses a language-independent graph meta-...
详细信息
Understanding the nature of interactions is regarded as one of the biggest challenges in projects related to complex adaptive systems. We discuss foundations for interactive computations in Interactive Intelligent Sys...
详细信息
Multi-context systems are a declarative formalism for interlinking knowledge-based systems (contexts) that interact via (possibly nonmonotonic) bridge rules. Interlinking knowledge provides ample opportunity for unexp...
详细信息
Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification,...
详细信息
In order to meet the users' demand, bike sharing systems must be regularly rebalanced. the problem of balancing bike sharing systems (BBSS) is concerned with designing optimal tours and operating instructions for ...
详细信息
ISBN:
(纸本)9783642406263;9783642406270
In order to meet the users' demand, bike sharing systems must be regularly rebalanced. the problem of balancing bike sharing systems (BBSS) is concerned with designing optimal tours and operating instructions for relocating bikes among stations to maximally comply withthe expected future bike demands. In this paper, we tackle the BBSS by means of Constraint Programming: first, we introduce two novel constraint models for the BBSS including a smart branching strategy that focusses on the most promising routes. Second, in order to speed-up the search process, we incorporate both models in a Large Neighborhood Search (LNS) approach that is adapted to the respective CP model. third, we perform a computational evaluation on instances based on real-world data, where we see that the LNS approach outperforms the Branch & Bound approach and is competitive with other existing approaches.
Fairly allocating distributed computing resources among workflow executions is critical to multi-user platforms. However, this problem remains mostly studied in clairvoyant and offline conditions, where task durations...
详细信息
ISBN:
(纸本)9783642400476
Fairly allocating distributed computing resources among workflow executions is critical to multi-user platforms. However, this problem remains mostly studied in clairvoyant and offline conditions, where task durations on resources are known, or the workload and available resources do not vary along time. We consider a non-clairvoyant, online fairness problem where the platform workload, task costs and resource characteristics are unknown and not stationary. We propose a fairness control loop which assigns task priorities based on the fraction of pending work in the workflows. Workflow characteristics and performance on the target resources are estimated progressively, as information becomes available during the execution. Our method is implemented and evaluated on 4 different applications executed in production conditions on the European Grid Infrastructure. Results show that our technique reduces slowdown variability by 3 to 7 compared to first-come-first-served.
the combination of rules and ontologies has been a fertile topic of research in the last years, withthe proposal of several different systemsthat achieve this goal. In this paper, we look at two of these formalisms,...
详细信息
暂无评论