Sciweavers

1639 search results - page 151 / 328
» Anytime Heuristic Search
Sort
View
ANOR
2007
80views more  ANOR 2007»
13 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
COR
2007
134views more  COR 2007»
13 years 10 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
EOR
2007
108views more  EOR 2007»
13 years 10 months ago
How much information do we need?
ct 7 Modern technology is succeeding in delivering more information to people at ever faster rates. Under traditional 8 views of rational decision making where individuals should e...
Peter M. Todd
ESA
2009
Springer
151views Algorithms» more  ESA 2009»
14 years 4 months ago
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signi...
Rudolf Fleischer, Xi Wu, Liwei Yuan