Sciweavers

1559 search results - page 71 / 312
» Some Group Theory Problems
Sort
View
PPSN
2004
Springer
15 years 9 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
KCAP
2003
ACM
15 years 9 months ago
A generic library of problem solving methods for scheduling applications
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdr&aa...
CORR
2000
Springer
149views Education» more  CORR 2000»
15 years 3 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
FCT
2009
Springer
15 years 10 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
130
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 8 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund