Sciweavers

1920 search results - page 159 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
NORDICHI
2004
ACM
15 years 12 months ago
On-line adjustment of dwell time for target selection by gaze
In eye typing systems, a dwell time that adjusts to the user’s natural typing speed is highly desirable. We present an algorithm for on-line adjustment of dwell time developed a...
Oleg Spakov, Darius Miniotas
IFIP
2001
Springer
15 years 11 months ago
An Evolutionary Approach for Pareto-optimal Configurations in SOC Platforms
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
RTSS
1994
IEEE
15 years 10 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 6 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati
JAIR
2007
112views more  JAIR 2007»
15 years 6 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter