17760 search results - page 322 / 3552 » A Generalization of the Massey-Ding Algorithm |
207
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
192
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
187
click to vote
ICRA
2006
IEEE
16 years 25 days ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
236
click to vote
APPROX
2005
Springer
16 years 11 days ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
184
click to vote
SPAA
2004
ACM
16 years 7 days ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...