Sciweavers

8141 search results - page 1526 / 1629
» Higher Order Generalization
Sort
View
FUN
2010
Springer
269views Algorithms» more  FUN 2010»
15 years 2 months ago
The Feline Josephus Problem
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
Frank Ruskey, Aaron Williams
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 2 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
MDM
2010
Springer
152views Communications» more  MDM 2010»
15 years 2 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
CODES
2009
IEEE
15 years 2 months ago
Native MPSoC co-simulation environment for software performance estimation
Performance estimation of Multi-Processor System-On-Chip (MPa high abstraction level is required in order to perform early architecture exploration and accurate design validations...
Patrice Gerin, Mian Muhammad Hamayun, Fréd&...
DAC
2009
ACM
15 years 2 months ago
Vicis: a reliable network for unreliable silicon
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacc...
« Prev « First page 1526 / 1629 Last » Next »