1769 search results - page 225 / 354 » Choice in Dynamic Linking |
152
click to vote
ICCAD
2001
IEEE
16 years 2 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
149
Voted
HIPEAC
2009
Springer
16 years 7 days ago
2009
Springer
Developing streaming applications on heterogenous multi-processor architectures like the Cell is difficult. Currently, application developers need to know about hardware details t...
167
click to vote
CEC
2009
IEEE
16 years 6 days ago
2009
IEEE
— Automatically synthesizing behaviors for robots with articulated bodies poses a number of challenges beyond those encountered when generating behaviors for simpler agents. One ...
144
click to vote
APPROX
2009
Springer
16 years 1 days ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
125
click to vote
WINE
2009
Springer
16 years 1 days ago
2009
Springer
We study the problem of designing prediction markets for random variables with continuous or countably infinite outcomes on the real line. Our interval betting languages allow tra...