Sciweavers

7129 search results - page 765 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ASPLOS
1994
ACM
15 years 11 months ago
Reducing Branch Costs via Branch Alignment
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
Brad Calder, Dirk Grunwald
ATAL
2006
Springer
15 years 10 months ago
Predicting people's bidding behavior in negotiation
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
Ya'akov Gal, Avi Pfeffer
AAAI
2010
15 years 8 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
MASCOTS
2010
15 years 8 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson
153
Voted
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 8 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir