Sciweavers

11 search results - page 2 / 3
» On the Existence and Determination of Satisfactory Partition...
Sort
View
FSTTCS
2009
Springer
13 years 10 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
13 years 9 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
CSL
2010
Springer
13 years 6 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
APVIS
2003
13 years 6 months ago
Visualising Class Cohesion with Virtual Worlds
High cohesion, or module strength, indicates that a system has been well partitioned into components which have strong internal relationships. An understanding of cohesion is an i...
Neville Churcher, Warwick Irwin, Ronald D. Kriz
AI
2007
Springer
13 years 5 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne