Sciweavers

9842 search results - page 416 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
170
Voted
GECCO
2008
Springer
160views Optimization» more  GECCO 2008»
15 years 5 months ago
Self-managing agents for dynamic scheduling in manufacturing
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
Ana Madureira, Filipe Santos, Ivo Pereira
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
15 years 4 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
157
Voted
TCS
2008
15 years 4 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
RTS
2000
143views more  RTS 2000»
15 years 4 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
PVLDB
2008
84views more  PVLDB 2008»
15 years 4 months ago
When is it time to rethink the aggregate configuration of your OLAP server?
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
Katja Hose, Daniel Klan, Matthias Marx, Kai-Uwe Sa...