5606 search results - page 287 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
AAAI
1996
15 years 7 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
171
click to vote
PVLDB
2008
15 years 6 months ago
2008
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
169
click to vote
ISCAS
2006
IEEE
16 years 16 days ago
2006
IEEE
A robust system architecture to achieve optical coherency free optimization. Several methods that had been proposed in the in multiple-beam free-space laser communication links wit...
151
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
153
click to vote
WG
2007
Springer
16 years 19 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...