Sciweavers

1424 search results - page 58 / 285
» The Multi-radius Cover Problem
Sort
View
96
Voted
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 2 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
AUSAI
2005
Springer
15 years 2 months ago
Understanding the Pheromone System Within Ant Colony Optimization
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
Stephen Gilmour, Mark Dras
95
Voted
SIAMCO
2008
83views more  SIAMCO 2008»
15 years 21 days ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
B. T. Kien, N.-C. Wong, J. C. Yao
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
15 years 21 days ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
67
Voted
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 4 months ago
Document Management as a Database Problem
abstract of invited paper Document management has many aspects, among them acquisition, storage, retrieval, presentation and processing of documents (work flow). These aspects will...
Rudolf Bayer