Sciweavers

570 search results - page 20 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
AI
2005
Springer
14 years 9 months ago
Adopt: asynchronous distributed constraint optimization with quality guarantees
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
ICLP
2010
Springer
15 years 1 months ago
Structured Interactive Musical Scores
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...
Mauricio Toro-Bermudez
SEBD
2001
145views Database» more  SEBD 2001»
14 years 11 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
PRICAI
2004
Springer
15 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
MP
2008
117views more  MP 2008»
14 years 9 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph