313 search results - page 47 / 63 » Solving Structured Polynomial Systems and Applications to Cr... |
132
click to vote
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
168
click to vote
COLT
1994
Springer
15 years 6 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
100
click to vote
IRREGULAR
1997
Springer
15 years 6 months ago
1997
Springer
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
HT
1997
ACM
15 years 5 months ago
1997
ACM
Activity spaces are usually task-specific and only common to a group of people who work together in a certain application domain. It is desirable to enable users to define and mod...
132
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...