Sciweavers

9842 search results - page 171 / 1969
» Problem complexity
Sort
View
ATAL
2008
Springer
15 years 4 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ICASSP
2010
IEEE
15 years 2 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
AH
2004
Springer
15 years 7 months ago
Evaluating Adaptive Problem Selection
: This paper presents an evaluation study that compares two different problem selection strategies for an Intelligent Tutoring System (ITS). The first strategy uses static problem ...
Antonija Mitrovic, Brent Martin
NIPS
2000
15 years 3 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 2 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf