10148 search results - page 349 / 2030 » Optimal sub-graphical models |
177
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper introduces Lazy Transitions Systems (LzTSs). The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. LzT...
208
click to vote
AAAI
2000
15 years 8 months ago
2000
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
189
click to vote
VISSYM
2003
15 years 8 months ago
2003
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several ...
179
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
177
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...