Sciweavers

413 search results - page 21 / 83
» On space constrained set selection problems
Sort
View
IJRR
2007
104views more  IJRR 2007»
13 years 7 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
CP
2003
Springer
14 years 19 days ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
GFKL
2005
Springer
105views Data Mining» more  GFKL 2005»
14 years 28 days ago
Variable Selection for Discrimination of More Than Two Classes Where Data are Sparse
In classification, with an increasing number of variables, the required number of observations grows drastically. In this paper we present an approach to put into effect the maxi...
Gero Szepannek, Claus Weihs
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 2 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SOFSEM
2004
Springer
14 years 22 days ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...