Sciweavers

3466 search results - page 279 / 694
» Fast computation of special resultants
Sort
View
ACG
2006
Springer
16 years 23 days ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003
JSSPP
2005
Springer
16 years 8 days ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
ICGI
2004
Springer
16 years 5 days ago
Learnability of Pregroup Grammars
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
Denis Béchet, Annie Foret, Isabelle Tellier
FPL
2003
Springer
95views Hardware» more  FPL 2003»
16 years 9 hour ago
Reconfigurable Hardware SAT Solvers: A Survey of Systems
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
Iouliia Skliarova, António de Brito Ferrari
ICPP
1989
IEEE
15 years 10 months ago
Exploring "Multiple Worlds" in Parallel
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...
Jonathan M. Smith, Gerald Q. Maguire Jr.