Sciweavers

25 search results - page 3 / 5
» GRASP with Path-Relinking for the Weighted Maximum Satisfiab...
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 9 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
15 years 3 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
CATS
2006
14 years 11 months ago
On-demand Bounded Broadcast Scheduling with Tight Deadlines
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
Chung Keung Poon, Feifeng Zheng, Yinfeng Xu
CORR
2006
Springer
150views Education» more  CORR 2006»
14 years 9 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
CPAIOR
2009
Springer
15 years 4 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan