1146 search results - page 7 / 230 » Finite cupping sets |
DLT
2009
13 years 5 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
ROBOCUP
1999
Springer
13 years 12 months ago
1999
Springer
The major purpose of our research is to study cooperative planning for multi-agent system in time-critical environment. The RoboCup simulator league is the most interesting target ...