Sciweavers

1219 search results - page 94 / 244
» Where to Look Next
Sort
View
CL
2000
Springer
15 years 8 months ago
Concurrent Constraint Programming with Process Mobility
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
David Gilbert, Catuscia Palamidessi
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 6 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
IFIP12
2007
15 years 5 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
IAAI
2001
15 years 5 months ago
Token Allocation Strategy for Free-Flight Conflict Solving
For the last 10 years, airlines have widely supported research on the development of airspaces where aircraft would be free to decide their trajectory: these areas where called Fr...
Géraud Granger, Nicolas Durand, Jean-Marc A...
HASE
2008
IEEE
15 years 4 months ago
Aiding Modular Design and Verification of Safety-Critical Time-Triggered Systems by Use of Executable Formal Specifications
Designing safety-critical systems is a complex process, and especially when the design is carried out at different f abstraction where the correctness of the design at one level i...
Kohei Sakurai, Péter Bokor, Neeraj Suri