Sciweavers

4438 search results - page 320 / 888
» The Case for Collaborative Programming
Sort
View
LICS
2008
IEEE
16 years 1 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
ACL
1992
15 years 8 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
IFIP
2004
Springer
16 years 4 days ago
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
Hubert Schmid, Thomas Worsch
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
16 years 1 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...