Sciweavers

749 search results - page 33 / 150
» Combinatory Models and Symbolic Computation
Sort
View
COCOON
2003
Springer
14 years 3 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
CSL
2010
Springer
13 years 11 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
CAAP
1990
14 years 1 months ago
A Markovian Concurrency Measure
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
Dominique Geniet, René Schott, Loÿs Th...
CAV
1993
Springer
127views Hardware» more  CAV 1993»
14 years 2 months ago
Symbolic Equivalence Checking
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun...
WINE
2005
Springer
100views Economy» more  WINE 2005»
14 years 3 months ago
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...