Sciweavers

1272 search results - page 149 / 255
» The Set Cover with Pairs Problem
Sort
View
SARA
2009
Springer
14 years 5 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
CIARP
2005
Springer
14 years 4 months ago
Classifier Selection Based on Data Complexity Measures
Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifie...
Edith Hernández-Reyes, Jesús Ariel C...
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
14 years 4 months ago
Optimal Operating Conditions for Overhead Crane Maneuvering Using Multi-objective Evolutionary Algorithms
While operating a crane for maximum productivity, the time of operation and the required energy are two important conflicting factors faced by a crane operator. In such a case, tr...
Kalyanmoy Deb, Naveen Kumar Gupta
FIWAC
1993
152views Cryptology» more  FIWAC 1993»
14 years 2 months ago
Disjoint Systems (Extended Abstract)
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
Noga Alon, Benny Sudakov
CATS
2007
14 years 3 days ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...