Sciweavers

4378 search results - page 44 / 876
» On the Complexity of Ordered Colourings
Sort
View
CSCW
2004
ACM
13 years 8 months ago
Ordering Systems: Coordinative Practices and Artifacts in Architectural Design and Planning
In their cooperative effort, architects depend critically on elaborate coordinative practices and artifacts. The article presents, on the basis of an in-depth study of architectura...
Kjeld Schmidt, Ina Wagner
ICALP
1998
Springer
14 years 1 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
CG
2000
Springer
14 years 1 months ago
Lambda-Search in Game Trees - with Application to Go
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
Thomas Thomsen
ICPR
2006
IEEE
14 years 10 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
TIME
2008
IEEE
14 years 3 months ago
Practical First-Order Temporal Reasoning
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...