Sciweavers

8828 search results - page 1279 / 1766
» Formal methods in practice
Sort
View
CONCUR
1999
Springer
15 years 11 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
KBSE
1999
IEEE
15 years 11 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 11 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
SIGGRAPH
1998
ACM
15 years 11 months ago
A Non-photorealistic Lighting Model for Automatic Technical Illustration
Phong-shaded 3D imagery does not provide geometric information of the same richness as human-drawn technical illustrations. A non-photorealistic lighting model is presented that a...
Amy Gooch, Bruce Gooch, Peter Shirley, Elaine Cohe...
INFOCOM
1997
IEEE
15 years 11 months ago
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
Robert L. Carter, Mark Crovella
« Prev « First page 1279 / 1766 Last » Next »