Sciweavers

811 search results - page 32 / 163
» Refactoring Using Type Constraints
Sort
View
CP
2011
Springer
12 years 8 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
ICFP
2006
ACM
14 years 8 months ago
OCaml + XDuce
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
Alain Frisch
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 8 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
IROS
2006
IEEE
111views Robotics» more  IROS 2006»
14 years 2 months ago
A Qualitative Visual Servoing to ensure the Visibility Constraint
— This paper describes an original control law called qualitative servoing. The particularity of this method is that no specific desired value is specified for the visual featu...
Anthony Remazeilles, Nicolas Mansard, Franç...
INTELLCOMM
2004
Springer
14 years 2 months ago
Preserving Referential Constraints in XML Document Association Relationship Update
Abstract. In this paper we propose the usage of W3C-standardized query language, XQuery, to accommodate XML Update. Our main aim is to enable the update without violating the seman...
Eric Pardede, J. Wenny Rahayu, David Taniar