1295 search results - page 178 / 259 » informs 1998 |
138
click to vote
TSMC
1998
15 years 4 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
140
click to vote
TSMC
1998
15 years 4 months ago
1998
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
146
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
199
click to vote
STACS
2012
Springer
14 years 16 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
187
click to vote
AGENTS
1998
Springer
15 years 9 months ago
1998
Springer
Which agent architectures are capable of justifying descriptions in terms of the `higher level' mental concepts applicable to human beings? We propose a new kind of architect...