Sciweavers

8413 search results - page 175 / 1683
» Ordering Problem Subgoals
Sort
View
WSC
2004
14 years 3 days ago
A Meta-Heuristic Based on Simulated Annealing for Solving Multiple-Objective Problems in Simulation Optimization
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...
IPL
2008
61views more  IPL 2008»
13 years 10 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
JC
2000
135views more  JC 2000»
13 years 10 months ago
Decision Problems in Quadratic Function Fields of High Genus
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
Renate Scheidler
DAC
2005
ACM
14 years 11 months ago
Effective bounding techniques for solving unate and binate covering problems
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
14 years 4 months ago
Empirical analysis of ideal recombination on random decomposable problems
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
Kumara Sastry, Martin Pelikan, David E. Goldberg