Sciweavers

2231 search results - page 155 / 447
» Alternation as a programming paradigm
Sort
View
PAMI
2007
176views more  PAMI 2007»
15 years 4 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
LICS
1993
IEEE
15 years 8 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson
CASES
2008
ACM
15 years 6 months ago
Predictable programming on a precision timed architecture
In a hard real-time embedded system, the time at which a result is computed is as important as the result itself. Modern processors go to extreme lengths to ensure their function ...
Ben Lickly, Isaac Liu, Sungjun Kim, Hiren D. Patel...
COMPUTER
2006
87views more  COMPUTER 2006»
15 years 4 months ago
What Can We Expect from Program Verification?
The role of intuition in software development was discussed in a most original fashion by Peter Naur in 1984. Yet there has been little subsequent interest in elaborating on Naur&#...
Michael Jackson
RE
2002
Springer
15 years 4 months ago
Exploring the Relationship between Project Selection and Requirements Analysis: An Empirical Study of the New Millennium Program
The relationship between project selection and requirements analysis is important, yet has not received much attention. The decisions made during project selection directly affect...
Mark Bergman, Gloria Mark