14548 search results - page 365 / 2910 » The Optimal Path-Matching Problem |
179
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
143
click to vote
ISAAC
1999
Springer
15 years 11 months ago
1999
Springer
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
191
click to vote
ISLPED
1998
ACM
15 years 11 months ago
1998
ACM
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and for...
158
Voted
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
179
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...