Sciweavers

150 search results - page 4 / 30
» Solving Small TSPs with Constraints
Sort
View
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
13 years 23 days ago
Control of a bicycle using virtual holonomic constraints
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
Luca Consolini, Manfredi Maggiore
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
14 years 2 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 16 days ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
ICDAR
2011
IEEE
12 years 5 months ago
A Digital Ink Recogntion Server for Handwritten Japanese Text
— This paper describes the design and implementation of a digital ink recognition server for handwritten Japanese text. Currently, fast and accurate recognition of online handwri...
Daqing Wang, Bilan Zhu, Masaki Nakagawa