Sciweavers

9842 search results - page 107 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
NIPS
2000
13 years 11 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
EOR
2011
131views more  EOR 2011»
13 years 1 months ago
Personnel scheduling: Models and complexity
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relati...
Peter Brucker, Rong Qu, Edmund K. Burke
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 10 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
TCBB
2008
73views more  TCBB 2008»
13 years 10 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
CVPR
2005
IEEE
14 years 1 days ago
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
Bogdan Georgescu, Xiang Sean Zhou, Dorin Comaniciu...