Sciweavers

4930 search results - page 361 / 986
» Learning minimal abstractions
Sort
View
BNCOD
1997
111views Database» more  BNCOD 1997»
15 years 8 months ago
Improved and Optimized Partitioning Techniques in Database Query Processing
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
Kjell Bratbergsengen, Kjetil Nørvåg
GLOBECOM
2007
IEEE
15 years 7 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 7 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 7 months ago
Green Codes: Energy-Efficient Short-Range Communication
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
Pulkit Grover, Anant Sahai
EOR
2008
96views more  EOR 2008»
15 years 6 months ago
Round robin scheduling - a survey
Abstract This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the area has been modified over time and toda...
Rasmus V. Rasmussen, Michael A. Trick