5606 search results - page 184 / 1122 » Randomization Techniques for Graphs. |
FOCI
2007
IEEE
15 years 7 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
107
Voted
IAT
2005
IEEE
15 years 6 months ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
105
click to vote
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
192
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
132
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...