5316 search results - page 77 / 1064 » Which Search Problems Are Random |
132
Voted
INFSOF
2008
15 years 16 days ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
149
Voted
IMCSIT
2010
14 years 10 months ago
2010
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
102
click to vote
IJCAI
2003
15 years 2 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
111
click to vote
ICGI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...