Sciweavers

1362 search results - page 212 / 273
» Means, Correlations and Bounds
Sort
View
ICALP
2000
Springer
15 years 10 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
INFOCOM
1995
IEEE
15 years 10 months ago
Analysis of One-Way Reservation Algorithms
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
Israel Cidon, Raphael Rom, Yuval Shavitt
EXACT
2008
15 years 9 months ago
Linked and Convergent Structures in Discourse-Based Reasoning
Abstract. Explanation and argumentation are fundamental to reasoning. They are therefore of some importance to artificial intelligence. Discourse-based reasoning (DBR) is a knowled...
Andrew Potter
ASPDAC
2005
ACM
104views Hardware» more  ASPDAC 2005»
15 years 8 months ago
On multiple-voltage high-level synthesis using algorithmic transformations
— This paper presents a multiple-voltage high-level synthesis methodology for low power DSP applications using algorithmic transformation techniques. Our approach is motivated by...
Hsueh-Chih Yang, Lan-Rong Dung