Sciweavers

3663 search results - page 345 / 733
» Problems in the ontology of computer programs
Sort
View
IFIP
2010
Springer
15 years 1 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
EUROPAR
2004
Springer
16 years 5 days ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
COSIT
2011
Springer
322views GIS» more  COSIT 2011»
14 years 6 months ago
CLP(QS): A Declarative Spatial Reasoning Framework
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
Mehul Bhatt, Jae Hee Lee, Carl Schultz
COMPGEOM
2006
ACM
16 years 23 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
IPPS
2003
IEEE
16 years 2 days ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...