Sciweavers

1723 search results - page 12 / 345
» Cycling in linear programming problems
Sort
View
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 9 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright
EUROGP
2005
Springer
14 years 3 months ago
Understanding Evolved Genetic Programs for a Real World Object Detection Problem
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
Victor Ciesielski, Andrew Innes, Sabu John, John M...
MICAI
2005
Springer
14 years 3 months ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko
ACSC
2007
IEEE
14 years 4 months ago
Jooj: Real-Time Support For Avoiding Cyclic Dependencies
The design guideline avoid dependency cycles among modules was first alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a program...
Hayden Melton, Ewan D. Tempero
IJCAI
2007
13 years 11 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings