Sciweavers

1711 search results - page 70 / 343
» Completing pseudojump operators
Sort
View
EDBT
2004
ACM
121views Database» more  EDBT 2004»
14 years 8 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
ENTCS
2008
87views more  ENTCS 2008»
13 years 8 months ago
The Complexity of Satisfiability for Fragments of CTL and CTL*
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
Arne Meier, Martin Mundhenk, Michael Thomas, Herib...
COR
2007
106views more  COR 2007»
13 years 7 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
POPL
1994
ACM
14 years 8 hour ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
HPCA
2004
IEEE
14 years 8 months ago
Program Counter Based Techniques for Dynamic Power Management
Reducing energy consumption has become one of the major challenges in designing future computing systems. This paper proposes a novel idea of using program counters to predict I/O...
Chris Gniady, Y. Charlie Hu, Yung-Hsiang Lu