Sciweavers

20573 search results - page 3922 / 4115
» The Computer's New Clothes
Sort
View
AMT
2009
Springer
263views Multimedia» more  AMT 2009»
14 years 5 months ago
A Dynamic Trust Network for Autonomy-Oriented Partner Finding
The problem of partner finding is to identify which entities (agents) can provide requested services from a group of entities. It can be found in open and distributed environment...
Hongjun Qiu, Jiming Liu, Ning Zhong
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 5 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ATAL
2009
Springer
14 years 5 months ago
First principles planning in BDI systems
BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning withi...
Lavindra de Silva, Sebastian Sardiña, Lin P...
BTW
2009
Springer
114views Database» more  BTW 2009»
14 years 5 months ago
Value Demonstration of Embedded Analytics for Front Office Applications
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...
Erik Nijkamp, Martin Oberhofer, Albert Maier
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 5 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
« Prev « First page 3922 / 4115 Last » Next »