Sciweavers

3250 search results - page 80 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICTAI
1997
IEEE
15 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
TIP
2008
175views more  TIP 2008»
14 years 9 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
MP
2002
84views more  MP 2002»
14 years 9 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
MP
2010
145views more  MP 2010»
14 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...