Sciweavers

1147 search results - page 95 / 230
» Differential Matching Constraints
Sort
View
ULPAA
1994
120views Hardware» more  ULPAA 1994»
13 years 10 months ago
EMail With A Mind of Its Own: The Safe-Tcl Language for Enabled Mail
A uniform extension language for email systems can radically extend the utility of electronic mail, simplifying the construction of mail-based services and permitting the delivery...
Nathaniel S. Borenstein
CP
2006
Springer
13 years 11 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
14 years 6 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
ENTCS
2006
183views more  ENTCS 2006»
13 years 9 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
ICALP
2007
Springer
14 years 3 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson