Sciweavers

5964 search results - page 394 / 1193
» A theory of speculative computation
Sort
View
GC
2007
Springer
15 years 7 months ago
An s -Hamiltonian Line Graph Problem
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deyin...
JSW
2007
126views more  JSW 2007»
15 years 7 months ago
On Remote and Virtual Experiments in eLearning
— The science of physics is based on theories and models as well as experiments: the former structure relations and simplify reality to a degree such that predictions on physical...
Sabina Jeschke, Harald Scheel, Thomas Richter, Chr...
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
15 years 7 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
COMGEO
1999
ACM
15 years 7 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
SAC
2008
ACM
15 years 7 months ago
Spatial vagueness and imprecision in databases
The impossibility of current spatial database systems and GIS to handle spatial vagueness and imprecision has been recognized as an important problem in the spatial database domai...
Alejandro Pauly, Markus Schneider