Sciweavers

2316 search results - page 86 / 464
» The many forms of hypercomputation
Sort
View
MST
2006
88views more  MST 2006»
15 years 4 months ago
Morpion Solitaire
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...
Erik D. Demaine, Martin L. Demaine, Arthur Langerm...
CORR
2004
Springer
117views Education» more  CORR 2004»
15 years 4 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas
BIB
2000
106views more  BIB 2000»
15 years 4 months ago
Wrapping and Interoperating Bioinformatics Resources Using CORBA
Bioinformaticians seeking to provide services to working biologists are faced with the twin problems of distribution and diversity of resources. Bioinformatics databases are distr...
Robert Stevens, Crispin Miller
ENTCS
2000
109views more  ENTCS 2000»
15 years 4 months ago
Forward and Backward Chaining in Linear Logic
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
James Harland, David J. Pym, Michael Winikoff
DM
2002
104views more  DM 2002»
15 years 4 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius