Sciweavers

11160 search results - page 2047 / 2232
» Incompleteness in a General Setting
Sort
View
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 10 months ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
ECML
2004
Springer
15 years 10 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
EMSOFT
2004
Springer
15 years 10 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
EMSOFT
2004
Springer
15 years 10 months ago
Using resource reservation techniques for power-aware scheduling
Minimizing energy consumption is an important issue in the design of real-time embedded systems. As many embedded systems are powered by rechargeable batteries, the goal is to ext...
Claudio Scordino, Giuseppe Lipari
ESAS
2004
Springer
15 years 10 months ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar
« Prev « First page 2047 / 2232 Last » Next »