8512 search results - page 313 / 1703 » Computing Theory With Relevance |
171
click to vote
EUROGP
2001
Springer
15 years 11 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
129
click to vote
ICRA
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper explores the possibility of using Sun altitude for localization of a robot in totally unknown territory. A set of Sun altitudes is obtained by processing a sequence of ...
171
click to vote
AAAI
2008
2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
15 years 9 months ago
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
161
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
185
click to vote
NAACL
1994
15 years 8 months ago
1994
We present results ofexperiments designed to assess the usefulness of a new technique for the evaluation of translation quality, comparing human rankings with automatic measures. ...