Sciweavers

9842 search results - page 1486 / 1969
» Problem complexity
Sort
View
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 8 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ESM
1998
15 years 8 months ago
On Hybrid Combination of Queueing and Simulation
This paper aims to and illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry, which are...
Nico M. van Dijk
AIPS
2009
15 years 8 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
ATAL
2010
Springer
15 years 8 months ago
Learning multi-agent state space representations
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
Yann-Michaël De Hauwere, Peter Vrancx, Ann No...
BIRTHDAY
2010
Springer
15 years 8 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
« Prev « First page 1486 / 1969 Last » Next »