Sciweavers

4110 search results - page 396 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
NIPS
2008
15 years 8 months ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
IJCAI
2001
15 years 8 months ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...
SIROCCO
2000
15 years 8 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
IJSIR
2010
161views more  IJSIR 2010»
15 years 4 months ago
Bacterial Foraging Optimization
Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for distributed optimization and control. BFOA is i...
Kevin M. Passino