4488 search results - page 400 / 898 » Properties of NP-Complete Sets |
187
click to vote
COMBINATORICS
2004
15 years 7 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
175
click to vote
CPC
2004
15 years 7 months ago
2004
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
192
click to vote
CSL
2004
Springer
15 years 7 months ago
2004
Springer
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
241
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
209
click to vote
EC
2002
15 years 7 months ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...