Sciweavers

10289 search results - page 1809 / 2058
» Standard bases in K
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
ATAL
2010
Springer
15 years 7 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
CCS
2010
ACM
15 years 6 months ago
Demonstrating cognitive packet network resilience to worm attacks
The need for network stability and reliability has led to the growth of autonomic networks [2] that can provide more stable and more reliable communications via on-line measuremen...
Georgia Sakellari, Erol Gelenbe
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
15 years 6 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung
AMC
2007
92views more  AMC 2007»
15 years 6 months ago
An integrated framework for continuous assessment and improvement of manufacturing systems
This paper presents an integrated framework for assessment and ranking of manufacturing systems based on management and organizational performance indicators. The integrated appro...
Ali Azadeh, S. F. Ghaderi, Y. Partovi Miran, V. Eb...
« Prev « First page 1809 / 2058 Last » Next »