5606 search results - page 596 / 1122 » Randomization Techniques for Graphs. |
165
click to vote
JAIR
2007
15 years 7 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
208
click to vote
TOMACS
2002
15 years 6 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
170
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Random contentions occur in optical burst-switched (OBS) networks because of one-way signaling and lack of optical buffers. These contentions can occur at low loads and are not nec...
182
Voted
ICFP
2003
ACM
16 years 7 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
247
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...