Sciweavers

1552 search results - page 57 / 311
» On the Complexity of Constant Propagation
Sort
View
AAAI
2006
15 years 7 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
PLDI
1996
ACM
15 years 10 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
AHSWN
2007
86views more  AHSWN 2007»
15 years 6 months ago
On the Robustness of Simple Indoor MANET Simulation Models
— We show that simple radio propagation and node mobility models widely used in MANET evaluation are not robust in indoor environments. Robust simulation models let researchers e...
H. Andrés Lagar-Cavilla, Gerard Baron, Thom...
ICALP
2007
Springer
16 years 14 days ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
AAAI
2010
15 years 7 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer