Sciweavers

365 search results - page 53 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
EC
2012
289views ECommerce» more  EC 2012»
12 years 3 months ago
Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm
In a multimodal optimization task, the main purpose is to find multiple optimal solutions (global and local), so that the user can have a better knowledge about different optima...
Kalyanmoy Deb, Amit Saha
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
CVPR
2006
IEEE
14 years 1 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
ATAL
2003
Springer
14 years 25 days ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda