Sciweavers

7811 search results - page 1267 / 1563
» computing 2004
Sort
View
AOSE
2004
Springer
15 years 9 months ago
A Framework for Patterns in Gaia: A Case-Study with Organisations
Abstract. The agent-oriented approach has been successfully applied to the solution of complex problems in dynamic open environments. However, to extend its use to mainstream compu...
Jorge Gonzalez-Palacios, Michael Luck
APPROX
2004
Springer
100views Algorithms» more  APPROX 2004»
15 years 9 months ago
Estimating the Distance to a Monotone Function
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 9 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 9 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
133
Voted
APWEB
2004
Springer
15 years 9 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
« Prev « First page 1267 / 1563 Last » Next »