Sciweavers

1920 search results - page 125 / 384
» The Complexity of the A B C Problem
Sort
View
IJRR
2010
113views more  IJRR 2010»
15 years 5 months ago
On the Topology of Discrete Strategies
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
Michael Erdmann
DM
2000
108views more  DM 2000»
15 years 6 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
COMPGEOM
2011
ACM
14 years 10 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
STACS
2010
Springer
16 years 1 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
DATE
2003
IEEE
134views Hardware» more  DATE 2003»
15 years 11 months ago
A Multi-Level Design Flow for Incorporating IP Cores: Case Study of 1D Wavelet IP Integration
The design of high performance multimedia systems in a short time force us to use IP's blocks in many designs. However, their correct integration in a design implies more com...
Adel Baganne, Imed Bennour, Mehrez Elmarzougui, Ri...