3653 search results - page 481 / 731 » On Recognizable Timed Languages |
179
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
182
click to vote
CSCLP
2005
Springer
16 years 4 days ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
203
click to vote
DEXA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Data intensive information is often published on the internet in the format of HTML tables. Extracting some of the information that is of users’ interest from the inter...
131
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
163
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...