Sciweavers

174 search results - page 14 / 35
» Do Actors Call Use Cases
Sort
View
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 7 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 7 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 1 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
IAT
2008
IEEE
13 years 7 months ago
Planning with iFALCON: Towards A Neural-Network-Based BDI Agent Architecture
This paper presents iFALCON, a model of BDI (beliefdesire-intention) agents that is fully realized as a selforganizing neural network architecture. Based on multichannel network m...
Budhitama Subagdja, Ah-Hwee Tan
SCN
2010
Springer
142views Communications» more  SCN 2010»
13 years 6 months ago
How to Pair with a Human
We introduce a protocol, that we call Human Key Agreement, that allows pairs of humans to establish a key in a (seemingly hopeless) case where no public-key infrastructure is avail...
Stefan Dziembowski