144 search results - page 18 / 29 » Solving Regular Tree Grammar Based Constraints |
132
click to vote
CONSTRAINTS
1998
15 years 4 months ago
1998
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
154
click to vote
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
120
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
159
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
145
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...