Sciweavers

13987 search results - page 549 / 2798
» The Two Guards Problem
Sort
View
CPAIOR
2010
Springer
15 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
WEBI
2010
Springer
15 years 5 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan
WEBI
2010
Springer
15 years 5 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
15 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras