1716 search results - page 47 / 344 » Proving Conditional Termination |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
EDOC
2006
IEEE
14 years 2 months ago
2006
IEEE
The correctness of business process models is of paramount importance for the application on an enterprise level. A severe problem is that several languages for business process m...
ATVA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
CSCLP
2006
Springer
14 years 11 days ago
2006
Springer
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
WRLA
2010
13 years 7 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...