Sciweavers

663 search results - page 66 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
13 years 11 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 7 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
TSE
2010
132views more  TSE 2010»
13 years 2 months ago
ASCENT: An Algorithmic Technique for Designing Hardware and Software in Tandem
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
Jules White, Brian Doughtery, Douglas C. Schmidt
DEDS
2008
87views more  DEDS 2008»
13 years 7 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
ADHOCNOW
2008
Springer
14 years 2 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...