5084 search results - page 256 / 1017 » Proving Possibility Properties |
144
click to vote
TCS
2010
15 years 1 months ago
2010
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
264
click to vote
RTA
2011
Springer
14 years 9 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
192
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
172
click to vote
AAIM
2008
Springer
16 years 28 days ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
147
click to vote
ECAL
2007
Springer
16 years 23 days ago
2007
Springer
The human body has a complex skeleton, giving a very high number of degrees of freedom, and is actuated by a large number of elastic elements muscles and tendons. As a consequence,...