Sciweavers

3318 search results - page 76 / 664
» The Weak Instance Model
Sort
View
IJCAI
2003
15 years 5 months ago
Logic Programs for Consistently Querying Data Integration Systems
We solve the problem of obtaining answers to queries posed to a mediated integration system un­ der the local-as-view paradigm that are consistent wrt to certain global integrity...
Loreto Bravo, Leopoldo E. Bertossi
RSA
2006
69views more  RSA 2006»
15 years 3 months ago
On smoothed analysis in dense graphs and formulas
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 10 months ago
Analyzing heuristic performance with response surface models: prediction, optimization and robustness
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
Enda Ridge, Daniel Kudenko
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
15 years 8 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...
SPATIALCOGNITION
2004
Springer
15 years 9 months ago
Modelling Models of Robot Navigation Using Formal Spatial Ontology
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...
John A. Bateman, Scott Farrar