Sciweavers

2266 search results - page 76 / 454
» Some Solutions to the Ignoring Problem
Sort
View
JCO
1998
136views more  JCO 1998»
15 years 1 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
ICIP
2001
IEEE
16 years 3 months ago
Prescient mode selection for robust video coding
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selec...
Rui Zhang, Shankar L. Regunathan, Kenneth Rose
IOR
2011
220views more  IOR 2011»
14 years 8 months ago
Optimal Inventory Policies when Purchase Price and Demand Are Stochastic
In this paper we consider the problem of a firm that faces a stochastic (Poisson) demand and must replenish from a market in which prices fluctuate, such as a commodity market. ...
Peter Berling, Victor Martínez-de-Alb&eacut...
SAC
2009
ACM
15 years 8 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...
CEC
2007
IEEE
15 years 7 months ago
How well do multi-objective evolutionary algorithms scale to large problems
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
Kata Praditwong, Xin Yao