Sciweavers

1736 search results - page 327 / 348
» On antimagic directed graphs
Sort
View
JAR
2000
90views more  JAR 2000»
13 years 7 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
RC
2000
99views more  RC 2000»
13 years 7 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IJFCS
1998
67views more  IJFCS 1998»
13 years 7 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
CN
1999
143views more  CN 1999»
13 years 7 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund
JCB
2002
131views more  JCB 2002»
13 years 7 months ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong