Sciweavers

2365 search results - page 339 / 473
» All things are connected
Sort
View
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 7 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
AAAI
1993
15 years 7 months ago
The Semantics of Event Prevention
In planning tasks an agent may often find himself in a situation demanding that he choose an action that would prevent some unwanted event from occurring. Similarly, in tasks invo...
Charles L. Ortiz Jr.
SLP
1994
77views more  SLP 1994»
15 years 7 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
USENIX
1994
15 years 7 months ago
Concert/C: A Language for Distributed Programming
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
Joshua S. Auerbach, Arthur P. Goldberg, Germ&aacut...
SWWS
2007
15 years 7 months ago
Modeling an Ontology for Managing Contexts in Smart Meeting Space
- In recent years, computing becomes more mobile and pervasive; these changes imply that applications and services must be aware of and adapt to their changing contexts in highly d...
Mohammad Rezwanul Huq, Nguyen Thi Thanh Tuyen, You...