Sciweavers

5523 search results - page 917 / 1105
» Improving application performance with hardware data structu...
Sort
View
CP
2007
Springer
16 years 18 days ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
WECWIS
2006
IEEE
114views ECommerce» more  WECWIS 2006»
16 years 13 days ago
Large-Scale Service Composition in Semantic Service Discovery
Self-Healing and self-optimizing service based applications are important steps towards the self-organizing Service Oriented Architectures (SOA). Self-Organizing SOAs replace serv...
Steffen Bleul, Thomas Weise, Kurt Geihs
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 11 months 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...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 10 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
STACS
1992
Springer
15 years 10 months ago
A Simplified Technique for Hidden-Line Elimination in Terrains
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Franco P. Preparata, Jeffrey Scott Vitter