Sciweavers

3690 search results - page 590 / 738
» Computation with classical sequents
Sort
View
COR
2006
122views more  COR 2006»
14 years 10 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
EOR
2006
130views more  EOR 2006»
14 years 10 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
EOR
2006
129views more  EOR 2006»
14 years 10 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
IJDMMM
2008
119views more  IJDMMM 2008»
14 years 10 months ago
A relational perspective on spatial data mining
: Remote sensing and mobile devices nowadays collect a huge amount of spatial data, which have to be analysed in order to discover interesting information about economic, social an...
Donato Malerba
CC
2007
Springer
158views System Software» more  CC 2007»
14 years 10 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner