Sciweavers

5606 search results - page 715 / 1122
» Randomization Techniques for Graphs.
Sort
View
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
15 years 10 months ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
AFRICACRYPT
2010
Springer
15 years 10 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...
179
Voted
AAAI
2007
15 years 9 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
220
Voted
FLAIRS
2007
15 years 9 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 8 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher