Sciweavers

9842 search results - page 306 / 1969
» Problem complexity
Sort
View
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
16 years 1 days ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
STTT
2008
162views more  STTT 2008»
15 years 6 months ago
Coping with large design spaces: design problem solving in fluidic engineering
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...
Benno Stein
DISOPT
2011
240views Education» more  DISOPT 2011»
15 years 1 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
ATAL
2007
Springer
15 years 10 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
TCS
2002
15 years 6 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat