10988 search results - page 1662 / 2198 » Algorithmic Folding Complexity |
238
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
233
click to vote
CIKM
2009
Springer
16 years 2 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
209
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
232
Voted
ISVC
2009
Springer
16 years 2 months ago
2009
Springer
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
166
click to vote
IWPEC
2009
Springer
16 years 2 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...