Sciweavers

4488 search results - page 71 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 7 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
CVPR
2001
IEEE
16 years 5 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia
PAAMS
2009
Springer
15 years 7 months ago
A Realistic Approach to Solve the Nash Welfare
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of th...
Antoine Nongaillard, Philippe Mathieu, Brigitte Ja...
KBSE
2010
IEEE
15 years 1 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 8 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura