Sciweavers

250 search results - page 27 / 50
» Stochastic Kronecker Graphs
Sort
View
ECAI
2000
Springer
14 years 1 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
ALGOSENSORS
2006
Springer
14 years 1 months ago
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
Sandip Roy, Yan Wan, Ali Saberi
CVPR
2009
IEEE
15 years 5 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
AIPS
2000
13 years 11 months ago
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
Marco Baioletti, Stefano Marcugini, Alfredo Milani
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
13 years 10 months ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...