Search
Now showing items 1-10 of 18
Integer programs and valid inequalities for planning problems
(Springer Verlag, 2000)
Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
Extended semantics and optimization algorithms for CP-networks
(2004)
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more ...
Direct routing: Algorithms and complexity
(2004)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
Minimum-hot-spot query trees for wireless sensor networks
(2010)
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optimally balanced communication tree with minimum ...
Matrix decomposition MFS algorithms
(2006)
We describe the application of the Method of Fundamental Solutions (MFS) to elliptic boundary value problems in rotationally symmetric problems. In particular, we show how efficient matrix decomposition MFS algorithms can ...
Market model for level of detail control
(ACM, 1999)
In virtual reality simulations the speed of rendering is vitally important. One of the techniques for controlling the frame rate is the assignment of different levels of detail for each object within a scene. The most ...
Feature mapping through maximization of the atomic interclass distances
(2015)
We discuss a way of implementing feature mapping for classification problems by expressing the given data through a set of functions comprising of a mixture of convex functions. In this way, a certain pattern’s potential ...
Optimized query routing trees for wireless sensor networks
(2011)
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
Instruction-Isomorphism in program execution
(2003)
This paper identifies a fundamental runtime program property: Instruction-Isomorphism. An instruction instance is said to be isomorphic if its component - Information derived from the instruction and its backward dynamic ...
Design space navigation for neighboring power-performance efficient microprocessor configurations
(2005)
Microprocessor design is a considerably complex task. First, microprocessors include many resources that may be configured in different ways. This leads to a time consuming multi-objective optimization problem. Second, ...