Sciweavers

976 search results - page 53 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ECCV
2002
Springer
14 years 11 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
EVOW
2008
Springer
13 years 11 months ago
Improving Metaheuristic Performance by Evolving a Variable Fitness Function
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
Keshav P. Dahal, Stephen Remde, Peter I. Cowling, ...
ENTCS
2007
119views more  ENTCS 2007»
13 years 9 months ago
PML: Toward a High-Level Formal Language for Biological Systems
Documentation of knowledge about biological pathways is often informal and vague, making it difficult to efficiently synthesize the work of others into a holistic understanding of...
Bor-Yuh Evan Chang, Manu Sridharan
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
14 years 2 months ago
Parsing and translation of expressions by genetic programming
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
David Jackson
ICML
2004
IEEE
14 years 2 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker