Sciweavers

2899 search results - page 270 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
WIA
2004
Springer
16 years 16 hour ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
MP
2007
95views more  MP 2007»
15 years 6 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
GLOBECOM
2008
IEEE
15 years 6 months ago
Power Allocation for Cognitive Radios Based on Primary User Activity in an OFDM System
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
Ziaul Hasan, Ekram Hossain, Charles L. Despins, Vi...
COMPGEOM
2003
ACM
15 years 12 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
JSA
2007
191views more  JSA 2007»
15 years 6 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....