Sciweavers

5153 search results - page 695 / 1031
» Introduction to Randomized Algorithms
Sort
View
FLAIRS
2008
15 years 6 months ago
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
Pavel Surynek
WSC
2008
15 years 6 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser
PODS
2010
ACM
159views Database» more  PODS 2010»
15 years 6 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
ICA
2007
Springer
15 years 6 months ago
Gradient Convolution Kernel Compensation Applied to Surface Electromyograms
Abstract. This paper introduces gradient based method for robust assessment of the sparse pulse sources, such as motor unit innervation pulse trains in the filed of electromyograp...
Ales Holobar, Damjan Zazula
ESEM
2008
ACM
15 years 6 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan