16404 search results - page 404 / 3281 » A set coverage problem |
175
Voted
FLAIRS
2004
15 years 8 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
203
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
192
Voted
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
187
click to vote
HEURISTICS
2007
15 years 6 months ago
2007
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...
171
click to vote
SIGCSE
2010
ACM
16 years 1 months ago
2010
ACM
Using effective teaching practices is a high priority for educators. One important pedagogical skill for computer science instructors is asking effective questions. This paper pre...