Sciweavers

1736 search results - page 262 / 348
» The rank-width of Directed Graphs
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
15 years 6 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
LWA
2007
15 years 5 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
P2PKM
2004
15 years 5 months ago
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
Giovanni Tummarello, Christian Morbidoni, Joackin ...
122
Voted
WSC
1998
15 years 5 months ago
Windows-based Animation with PROOF
Proof AnimationTM is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsize...
James O. Henriksen
123
Voted
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 4 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés