Sciweavers

1968 search results - page 27 / 394
» The Complexity of Valued Constraint Models
Sort
View
ATAL
2010
Springer
13 years 9 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
COMPULOG
1999
Springer
14 years 19 days ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
EDBT
2009
ACM
106views Database» more  EDBT 2009»
14 years 7 days ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
CPC
2002
75views more  CPC 2002»
13 years 8 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
EMISA
2006
Springer
14 years 1 days ago
Challenges and Solutions in Planning Information Systems for Networked Value Constellations
: Nowadays businesses often decide to form networked value constellations in order to satisfy complex customer needs. To fulfill the value-based requirements of an e-Business idea ...
Novica Zarvic, Maya Daneva