Sciweavers

3946 search results - page 85 / 790
» The computational complexity of choice sets
Sort
View
CP
2007
Springer
15 years 6 months ago
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
SPAA
2010
ACM
15 years 4 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
COMAD
2009
15 years 29 days ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
CG
2004
Springer
14 years 11 months ago
A stratification approach for modeling two-dimensional cell complexes
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
Sinésio Pesco, Geovan Tavares, Hélio...
DCC
2005
IEEE
15 years 11 months ago
A Point-Set Compression Heuristic for Fiber-Based Certificates of Authenticity
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
Darko Kirovski