Sciweavers

3131 search results - page 534 / 627
» Phase-Based Local Features
Sort
View
EOR
2010
119views more  EOR 2010»
15 years 6 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
CCR
2006
116views more  CCR 2006»
15 years 6 months ago
The devil and packet trace anonymization
Releasing network measurement data--including packet traces-to the research community is a virtuous activity that promotes solid research. However, in practice, releasing anonymiz...
Ruoming Pang, Mark Allman, Vern Paxson, Jason Lee
CN
2006
74views more  CN 2006»
15 years 6 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...