Sciweavers

4438 search results - page 250 / 888
» The Case for Collaborative Programming
Sort
View
AGP
1997
IEEE
15 years 11 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
DAC
1995
ACM
15 years 10 months ago
Performance Analysis of Embedded Software Using Implicit Path Enumeration
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...
Yau-Tsun Steven Li, Sharad Malik
DAM
1998
88views more  DAM 1998»
15 years 6 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
UIST
1995
ACM
15 years 10 months ago
Migratory Applications
We introduce a new genre of user interface applications that can migrate from one machine to another, taking their user interface and application contexts with them, and continue ...
Krishna Bharat, Luca Cardelli