2125 search results - page 266 / 425 » On Graph Complexity |
148
Voted
AIPS
2010
15 years 3 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
150
Voted
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
106
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...
122
Voted
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
159
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...