5326 search results - page 329 / 1066 » On what we can ensure |
180
click to vote
AAAI
2008
15 years 9 months ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
157
click to vote
AAAI
2008
15 years 9 months ago
2008
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...
156
click to vote
LISA
2007
15 years 9 months ago
2007
Network patterns are based on generic algorithms that execute on tree-based overlays. A set of such patterns has been developed at KTH to support distributed monitoring in network...
169
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
— Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chem...
156
click to vote
ACL
2007
15 years 8 months ago
2007
We present a user requirements study for Question Answering on meeting records that assesses the difficulty of users questions in terms of what type of knowledge is required in or...