Sciweavers

5493 search results - page 134 / 1099
» Effectively Polynomial Simulations
Sort
View
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
16 years 1 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
132
Voted
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
15 years 10 months ago
Path Planning for Permutation-Invariant Multi-Robot Formations
— In this paper we demonstrate path planning for our formation space that represents permutation-invariant multirobot formations. Earlier methods generally pre-assign roles for e...
Stephen Kloder, Seth Hutchinson
168
Voted
IJCAI
1993
15 years 6 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
143
Voted
COMBINATORICS
2004
129views more  COMBINATORICS 2004»
15 years 4 months ago
Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
Philip Matchett
144
Voted
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 7 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou