Sciweavers

1225 search results - page 96 / 245
» The Instance Complexity Conjecture
Sort
View
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
14 years 3 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
IDEAS
2007
IEEE
84views Database» more  IDEAS 2007»
14 years 3 months ago
Multiple Entry Indexing and Double Indexing
Traditional indexing techniques are not well suited for complex data types such as spatial, spatio-temporal, and multimedia data types, where an instance is a composite of multipl...
Victor Teixeira de Almeida, Ralf Hartmut Güti...
NIME
2005
Springer
168views Music» more  NIME 2005»
14 years 2 months ago
Connecting strangers at a train station
In this paper we describe a virtual instrument or a performance space, placed at Høje Tåstrup train station in Denmark, which is meant to establish communicative connections bet...
Ole Gregersen, Lars Pellarin, Jakob Olsen, Niels B...
STACS
2005
Springer
14 years 2 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
CDVE
2006
Springer
109views Visualization» more  CDVE 2006»
14 years 25 days ago
Use of Patterns for Knowledge Management in the Ceramic Tile Design Chain
Knowledge Management (KM) is a complex objective, especially in the instance of extended enterprises consisting of SMEs, and critical in new product design and development (NPD). T...
María Jesús Agost, Fernando Romero, ...