4110 search results - page 79 / 822 » Efficient algorithms for the 2-gathering problem |
155
click to vote
CIARP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
116
click to vote
FLAIRS
2001
15 years 5 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
132
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
123
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
176
click to vote
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...