Sciweavers

1648 search results - page 145 / 330
» On the generation of bicliques of a graph
Sort
View
ICMAS
1998
13 years 11 months ago
Developing Formal Specifications to Coordinate Heterogeneous Autonomous Agents
We have been developing an approach for the distributed coordination of heterogeneous, autonomous agents. This approach takes as input (a) agent skeletons, giving compact descript...
Munindar P. Singh
IWMMDBMS
1996
88views more  IWMMDBMS 1996»
13 years 11 months ago
Automating the Organization of Presentations for Playout Management in Multimedia Databases
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...
Veli Hakkoymaz, Gultekin Özsoyoglu
ENDM
2010
101views more  ENDM 2010»
13 years 10 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ENTCS
2008
103views more  ENTCS 2008»
13 years 10 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 10 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...