Sciweavers

60 search results - page 8 / 12
» The Connectivity of Boolean Satisfiability: Computational an...
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
Broadcasting and routing in faulty mesh networks
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...
Milos Stojmenovic, Amiya Nayak
STACS
1997
Springer
15 years 3 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal
FUIN
2000
71views more  FUIN 2000»
14 years 11 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
BMCBI
2008
115views more  BMCBI 2008»
14 years 12 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
AIIA
2005
Springer
15 years 5 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut