Sciweavers

46 search results - page 5 / 10
» The Elimination Procedure for the Phylogeny Number
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 7 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
LICS
2002
IEEE
14 years 14 days ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
DAM
1999
100views more  DAM 1999»
13 years 7 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
POPL
1997
ACM
13 years 11 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
ICOIN
2001
Springer
13 years 12 months ago
An Intelligent On-Demand Multicast Routing Protocol in Ad Hoc Networks
In thispaper; we present an intelligent on-demandmulticast routing protocol (IOD-MRP)which is suited in rapidly changing network environments, such as ad hoc networks. This protoc...
Kuochen Wang, Chaou-Tang Chang