Sciweavers

87 search results - page 6 / 18
» When is it better not to look ahead
Sort
View
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
13 years 12 months ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 6 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
AAAI
1996
13 years 8 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
ATAL
2008
Springer
13 years 8 months ago
Strategic betting for competitive agents
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
Liad Wagman, Vincent Conitzer
COLING
2008
13 years 8 months ago
Choosing the Right Translation: A Syntactically Informed Classification Approach
One style of Multi-Engine Machine Translation architecture involves choosing the best of a set of outputs from different systems. Choosing the best translation from an arbitrary s...
Simon Zwarts, Mark Dras