Sciweavers

1995 search results - page 105 / 399
» What's the Problem
Sort
View
142
Voted
DAM
2010
104views more  DAM 2010»
15 years 2 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
IJACI
2010
86views more  IJACI 2010»
15 years 2 months ago
Leveraging the Web Platform for Ambient Computing: An Experience
This paper explores a very simple idea: what can be achieved by using the principles and the technologies of the Web Platform1 when they are applied to Ambient Computing? To answer...
Fabio Mancinelli
MOR
2010
106views more  MOR 2010»
15 years 2 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...
LPNMR
2011
Springer
14 years 6 months ago
Logic, Probability and Computation: Foundations and Issues of Statistical Relational AI
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...
David Poole
ICALP
2010
Springer
15 years 8 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi