Sciweavers

1312 search results - page 227 / 263
» Formally Optimal Boxing
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
PVLDB
2008
132views more  PVLDB 2008»
13 years 7 months ago
Access control over uncertain data
Access control is the problem of regulating access to secret information based on certain context information. In traditional applications, context information is known exactly, p...
Vibhor Rastogi, Dan Suciu, Evan Welbourne
RAS
2008
124views more  RAS 2008»
13 years 7 months ago
On redundancy, efficiency, and robustness in coverage for multiple robots
Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit every point in a target are...
Noam Hazon, Gal A. Kaminka
CP
2010
Springer
13 years 6 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
JELIA
2010
Springer
13 years 6 months ago
Decomposition of Distributed Nonmonotonic Multi-Context Systems
Multi-Context Systems (MCS) are formalisms that enable the interlinkage of single knowledge bases, called contexts, via bridge rules. Recently, the evaluation of heterogeneous, no...
Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter...