903 search results - page 178 / 181 » On the reduction of a random basis |
135
click to vote
AIPS
2009
15 years 2 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
135
Voted
CCS
2010
ACM
15 years 2 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
111
click to vote
SAC
2010
ACM
15 years 2 months ago
2010
ACM
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
139
Voted
AI
2010
Springer
15 years 1 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
179
Voted
AI
2008
Springer
15 years 1 months ago
2008
Springer
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...