Sciweavers

ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 11 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 11 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 11 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 11 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
AI
2008
Springer
13 years 11 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
ADHOC
2008
183views more  ADHOC 2008»
13 years 11 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
ADHOC
2010
126views more  ADHOC 2010»
13 years 11 months ago
Stable energy-aware topology management in ad hoc networks
Abstract-- The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology manag...
Lichun Bao, J. J. Garcia-Luna-Aceves
AAMAS
2010
Springer
13 years 11 months ago
Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 11 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
AAECC
2007
Springer
127views Algorithms» more  AAECC 2007»
13 years 11 months ago
Skew-cyclic codes
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...
Delphine Boucher, Willi Geiselmann, Felix Ulmer