5015 search results - page 305 / 1003 » Model Checking a Path |
180
click to vote
SIGECOM
2005
ACM
16 years 2 days ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
145
click to vote
JCC
2007
15 years 6 months ago
2007
Abstract: A hybrid quantum mechanical/molecular mechanical (QM/MM) potential energy function with HartreeFock, density functional theory (DFT), and post-HF (RIMP2, MP2, CCSD) capab...
191
click to vote
ICS
2011
Tsinghua U.
14 years 10 months ago
2011
Tsinghua U.
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
176
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
155
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...