Sciweavers

1067 search results - page 26 / 214
» Problem Solving in the DISCO Constraint Database System
Sort
View
FOIKS
2008
Springer
13 years 9 months ago
Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
Henning Köhler
EOR
2008
93views more  EOR 2008»
13 years 7 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
ECAI
2004
Springer
14 years 29 days ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 7 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
JSA
1998
72views more  JSA 1998»
13 years 7 months ago
Network conscious design of distributed real-time systems
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
Jung Woo Park, Young Shin Kim, Seongsoo Hong, Mana...