Sciweavers

3513 search results - page 509 / 703
» Super Logic Programs
Sort
View
JUCS
2006
104views more  JUCS 2006»
15 years 20 days ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
JLP
2007
159views more  JLP 2007»
15 years 18 days ago
Reasoning about interaction protocols for customizing web service selection and composition
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
118
Voted
TVLSI
2008
111views more  TVLSI 2008»
15 years 18 days ago
GlitchLess: Dynamic Power Minimization in FPGAs Through Edge Alignment and Glitch Filtering
This paper describes Glitchless, a circuit-level technique for reducing power in FPGAs by eliminating unnecessary logic transitions called glitches. This is done by adding program...
Julien Lamoureux, Guy G. Lemieux, Steven J. E. Wil...
139
Voted
AAMAS
1999
Springer
15 years 12 days ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
156
Voted
ICDAR
2009
IEEE
14 years 10 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...