Sciweavers

10890 search results - page 1955 / 2178
» Automatic Complexity Analysis
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 10 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
ATAL
2006
Springer
15 years 10 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
CCS
2006
ACM
15 years 10 months ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang
COMSWARE
2006
IEEE
15 years 10 months ago
Architecting protocol stack optimizations on mobile devices
Applications using traditional protocol stacks (e.g TCP/IP) from wired networks do not function efficiently in mobile wireless scenarios. This is primarily due to the layered archi...
Vijay T. Raisinghani, Sridhar Iyer
« Prev « First page 1955 / 2178 Last » Next »