Sciweavers

149 search results - page 9 / 30
» Crossing Numbers and Parameterized Complexity
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
Determining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...
EH
2004
IEEE
117views Hardware» more  EH 2004»
13 years 11 months ago
Multi-objective Optimization of a Parameterized VLIW Architecture
The use of Application Specific Instruction-set Processors (ASIP) in embedded systems is a solution to the problem of increasing complexity in the functions these systems have to ...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi,...
TCAD
2002
118views more  TCAD 2002»
13 years 7 months ago
Application-specific clustered VLIW datapaths: early exploration on a parameterized design space
Specialized clustered very large instruction word (VLIW) processors combined with effective compilation techniques enable aggressive exploitation of the high instruction-level para...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
IMR
2003
Springer
14 years 20 days ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
CAV
2010
Springer
206views Hardware» more  CAV 2010»
13 years 10 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl