Sciweavers

826 search results - page 106 / 166
» On Local Register Allocation
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
POPL
2002
ACM
14 years 9 months ago
An efficient profile-analysis framework for data-layout optimizations
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
Rastislav Bodík, Shai Rubin, Trishul M. Chi...
ICC
2007
IEEE
197views Communications» more  ICC 2007»
14 years 3 months ago
A Distributed Scheduling Algorithm for Multiuser MIMO Systems with 1-bit SINR Feedback
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
Stefano Sorrentino, Umberto Spagnolini, Lino Moret...
IPPS
2007
IEEE
14 years 3 months ago
Packet Reordering in Network Processors
Network processors today consists of multiple parallel processors (microengines) with support for multiple threads to exploit packet level parallelism inherent in network workload...
S. Govind, R. Govindarajan, Joy Kuri
EUC
2005
Springer
14 years 2 months ago
An Integrated Scheme for Address Assignment and Service Location in Pervasive Environments
We propose an efficient scheme called CoReS (Configuration and Registration Scheme) that integrates address assignment and service location for ad hoc networks prevalent in pervasi...
Mijeom Kim, Mohan Kumar, Behrooz Shirazi