10575 search results - page 1583 / 2115 » T2Script Programming Language |
138
click to vote
CP
2003
Springer
16 years 8 days ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
167
click to vote
CP
2003
Springer
16 years 8 days ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
157
Voted
ICALP
2003
Springer
16 years 7 days ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
218
click to vote
ICALP
2003
Springer
16 years 7 days ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
176
click to vote
ICALP
2003
Springer
16 years 7 days ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...