Sciweavers

976 search results - page 86 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ICIP
2002
IEEE
14 years 10 months ago
Data rate smoothing in interactive walkthrough applications using 2D prefetching
Compared to a geometric approach, image based rendering applied to 3D view reconstruction doesn't require 3D model construction and doesn't depend on the complexity of t...
Vitali Zagorodnov, Peter J. Ramadge
ISSAC
2007
Springer
91views Mathematics» more  ISSAC 2007»
14 years 3 months ago
Generation and optimisation of code using coxeter lattice paths
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
Thomas J. Ashby, Anthony D. Kennedy, Stephen M. Wa...
ICSE
2003
IEEE-ACM
14 years 2 months ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
14 years 1 months ago
Receding horizon temporal logic planning for dynamical systems
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
Tichakorn Wongpiromsarn, Ufuk Topcu, R. Richard Mu...
ATAL
2006
Springer
14 years 23 days ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm