Search
Now showing items 1-10 of 191
A distributed algorithm for gathering many fat mobile robots in the plane
(2013)
We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots ...
Adaptive emergency scenery video communications using HEVC for responsive decision support in disaster incidents
(Institute of Electrical and Electronics Engineers Inc., 2015)
This study proposes a unifying framework for m-Health video communication systems that provides for the joint optimization of video quality, bitrate demands, and encoding time. The framework is video modality and infrastructure ...
Folk dance evaluation using laban movement analysis
(2015)
Motion capture (mocap) technology is an efficient method for digitizing art performances, and is becoming increasingly popular in the preservation and dissemination of dance performances. Although technically the captured ...
Selective local tone mapping
(2013)
When preparing high dynamic range images (HDR) for display on standard monitors, it is often necessary to make a choice between global and local tone mapping. While the former is simple and efficient, it may fail to reproduce ...
Complexity of rational and irrational Nash equilibria
(2011)
We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
The complexity of decision problems about nash equilibria in win-lose games
(2012)
We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist
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 ...
Universal bufferless routing
(2005)
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...
Direct routing: Algorithms and complexity
(2006)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...