728 search results - page 58 / 146 » New Directions in Question Answering |
101
click to vote
DM
2008
15 years 1 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
IJON
2006
15 years 1 months ago
2006
This paper addresses the following question: ``What neural circuits can emulate the monosynaptic correlogram generated by a direct connection between two neurons?'' The ...
103
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
109
click to vote
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...
111
click to vote
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...