Sciweavers

3320 search results - page 187 / 664
» Heuristics for the Phylogeny Problem
Sort
View
JUCS
2008
148views more  JUCS 2008»
15 years 6 months ago
SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
Ana Belén Gil, Raquel Rodríguez, Fra...
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 7 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
LSSC
2005
Springer
16 years 3 days ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
EVOW
2003
Springer
15 years 12 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle