Sciweavers

4850 search results - page 953 / 970
» Proof and Computation in Geometry
Sort
View
DRM
2007
Springer
15 years 4 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 4 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
INFOCOM
2006
IEEE
15 years 4 months ago
Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
Prashanth Hande, Sundeep Rangan, Mung Chiang
MOBICOM
2006
ACM
15 years 4 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
INFOCOM
2005
IEEE
15 years 4 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic