Sciweavers

1272 search results - page 122 / 255
» The Set Cover with Pairs Problem
Sort
View
ASPDAC
2000
ACM
83views Hardware» more  ASPDAC 2000»
14 years 3 months ago
A new approach to assembly software retargeting for microcontrollers
A new approach is proposed to translate existing software programs from one instruction set to other instruction sets at the level. The behaviors of instructions are abstractly re...
Ing-Jer Huang, Dao-Zhen Chen
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
CP
2005
Springer
14 years 4 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
SECON
2010
IEEE
13 years 8 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
CHI
2008
ACM
14 years 11 months ago
Heuristic evaluation for games: usability principles for video game design
Most video games require constant interaction, so game designers must pay careful attention to usability issues. However, there are few formal methods for evaluating the usability...
David Pinelle, Nelson Wong