Sciweavers

942 search results - page 89 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
CPC
2006
110views more  CPC 2006»
13 years 10 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
AAAI
2008
14 years 9 days ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
DAC
2007
ACM
14 years 11 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
MA
1999
Springer
96views Communications» more  MA 1999»
14 years 2 months ago
CPU Resource Control for Mobile Programs
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support ef...
Raju Pandey, Manoj Lal
ATAL
2005
Springer
14 years 3 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe