105 search results - page 16 / 21 » Some Applications of Graph Bandwidth to Constraint Satisfact... |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
SPLST
2003
14 years 10 months ago
2003
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
TIT
1998
14 years 9 months ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
ICASSP
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...