6693 search results - page 37 / 1339 » On an anytime algorithm for control |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
CEC
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract -_The evolution of a heterogeneousteam behavior can he a very demanding task. In order to promote the greatest level of specialization team members should be evolved in se...
MAAMAW
1993
Springer
14 years 1 months ago
1993
Springer
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
ICCBR
2010
Springer
14 years 1 months ago
2010
Springer
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
AIPS
2003
13 years 10 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...