4110 search results - page 506 / 822 » Efficient algorithms for the 2-gathering problem |
211
click to vote
ADC
2008
Springer
16 years 1 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
166
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
Many evolutionary algorithms have been lately developed for solving multiobjective problems, appealing or not to the Pareto optimality concept. Although, the evolutionary technique...
181
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
—A mobile device in a MANET must be assigned a free IP address before it may participate in unicast communication. This is a fundamental and difficult problem in the practical us...
289
click to vote
ICAART
2010
INSTICC
16 years 3 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
161
click to vote
PKDD
2005
Springer
16 years 5 days ago
2005
Springer
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...