5022 search results - page 540 / 1005 » Data structures and problem solving using Java |
138
click to vote
IDA
2003
Springer
15 years 9 months ago
2003
Springer
In sequential prediction tasks, one repeatedly tries to predict the next element in a sequence. A classical way to solve these problems is to fit an order-n Markov model to the da...
144
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
155
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
260
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
152
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...