Sciweavers

5052 search results - page 974 / 1011
» On the Complexity of Ordered Colorings
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 7 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 7 months ago
Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
Animashree Anandkumar, Ting He, Chatschik Bisdikia...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
EC
2010
157views ECommerce» more  EC 2010»
13 years 7 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
AIM
2006
13 years 7 months ago
Comparative Analysis of Frameworks for Knowledge-Intensive Intelligent Agents
maintain awareness of its environment for a long period of time. Additionally, knowledge-intensive agents must be engineered such that their knowledge can be easily updated as envi...
Randolph M. Jones, Robert E. Wray III