Sciweavers

4066 search results - page 284 / 814
» Almost Complete Sets
Sort
View
DAGSTUHL
2008
15 years 8 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
CLIMA
2006
15 years 8 months ago
An Argumentation-Based Negotiation for Distributed Extended Logic Programs
Abstract. The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules...
Iara Carnevale de Almeida, José Júli...
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 6 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
IJFCS
2006
77views more  IJFCS 2006»
15 years 6 months ago
Spike Trains in Spiking Neural P Systems
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
Gheorghe Paun, Mario J. Pérez-Jiméne...
139
Voted
TRS
2008
15 years 6 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa