3221 search results - page 138 / 645 » Termination of Linear Programs |
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
TPDS
2008
13 years 9 months ago
2008
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
PLPV
2009
ACM
14 years 6 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...