Sciweavers

229 search results - page 39 / 46
» A New Method of Using Sensor Network for Solving Pursuit-Eva...
Sort
View
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
TASE
2008
IEEE
13 years 7 months ago
Group Elevator Scheduling With Advance Information for Normal and Emergency Modes
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...
Peter B. Luh, Bo Xiong, Shi-Chung Chang
IROS
2009
IEEE
186views Robotics» more  IROS 2009»
14 years 2 months ago
A statistical approach to gas distribution modelling with mobile robots - The Kernel DM+V algorithm
— Gas distribution modelling constitutes an ideal application area for mobile robots, which – as intelligent mobile gas sensors – offer several advantages compared to station...
Achim J. Lilienthal, Matteo Reggente, Marco Trinca...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 2 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl