Sciweavers

6315 search results - page 872 / 1263
» Approximating Solution Structure
Sort
View
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 1 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang
LICS
2006
IEEE
16 years 1 months ago
A Characterisation of First-Order Constraint Satisfaction Problems
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
Benoit Larose, Cynthia Loten, Claude Tardif
QEST
2006
IEEE
16 years 1 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
174
Voted
ASSETS
2006
ACM
16 years 29 days ago
SADIe: : transcoding based on CSS
Visually impaired users are hindered in their efforts to access the World Wide Web (Web) because their information and presentation requirements are different from those of a sigh...
Simon Harper, Sean Bechhofer, Darren Lunn
160
Voted
SIGCSE
2006
ACM
146views Education» more  SIGCSE 2006»
16 years 29 days ago
'Programming language paradigms' instruction through designing a new paradigm
Undergraduate and master’s students enrolled in a programming language paradigms class are given the assignment to design a new programming language paradigm. The students are a...
Hilda M. Standley