Sciweavers

989 search results - page 148 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 11 days ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
VLDB
2004
ACM
151views Database» more  VLDB 2004»
14 years 1 months ago
Query Rewrite for XML in Oracle XML DB
Oracle XML DB integrates XML storage and querying using the Oracle relational and object relational framework. It has the capability to physically store XML documents by shredding...
Muralidhar Krishnaprasad, Zhen Hua Liu, Anand Mani...
ICRA
2009
IEEE
161views Robotics» more  ICRA 2009»
14 years 2 months ago
Multi-vehicle path planning in dynamically changing environments
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
Ali Ahmadzadeh, Nader Motee, Ali Jadbabaie, George...
SAT
2007
Springer
107views Hardware» more  SAT 2007»
14 years 2 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow