Sciweavers

2131 search results - page 306 / 427
» A computational approximation to the AIXI model
Sort
View
SAC
2008
ACM
15 years 5 months ago
Symbiosis in logic-based pointcuts over a history of join points
Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, ...
Kris Gybels, Charlotte Herzeel, Theo D'Hondt
IJRR
2010
162views more  IJRR 2010»
15 years 4 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
MFCS
2010
Springer
15 years 4 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
QUESTA
2010
131views more  QUESTA 2010»
15 years 4 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...