Sciweavers

3897 search results - page 163 / 780
» complexity 2010
Sort
View
COMCOM
2010
118views more  COMCOM 2010»
15 years 3 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
ASIACRYPT
2010
Springer
15 years 4 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
ISSEP
2010
Springer
243views Education» more  ISSEP 2010»
16 years 3 months ago
Object-Oriented Modeling of Object-Oriented Concepts
Teaching introductory object-oriented programming presents considerable challenges. Some of these challenges are due to the intrinsic complexity of the subject matter — object-or...
Michela Pedroni, Bertrand Meyer
LION
2010
Springer
307views Optimization» more  LION 2010»
15 years 11 months ago
A Column Generation Heuristic for the General Vehicle Routing Problem
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...
Asvin Goel
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
15 years 11 months ago
The Logic of Large Enough
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
Eerke A. Boiten, Dan Grundy