Sciweavers

4850 search results - page 968 / 970
» Approximate Data Structures with Applications
Sort
View
NJC
2000
169views more  NJC 2000»
13 years 7 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
ELECTRONICMARKETS
1998
117views more  ELECTRONICMARKETS 1998»
13 years 7 months ago
Towards Open Electronic Contracting
AbstractAbstractAbstractAbstract A design and pilot implementation of a system, called InterProcs, supporting electronic contracting is presented. A key concept in the design of th...
Ronald M. Lee
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
TMC
2002
118views more  TMC 2002»
13 years 7 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
CORR
2010
Springer
197views Education» more  CORR 2010»
13 years 6 months ago
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...