2137 search results - page 397 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
109
click to vote
SSD
2005
Springer
15 years 7 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
136
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
114
click to vote
IJCAI
2007
15 years 3 months ago
2007
Statistical relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. We previously introduced view learnin...
106
click to vote
TSP
2008
15 years 1 months ago
2008
Carrier frequency offset (CFO) mitigation is critical for orthogonal frequency-division multiplexing (OFDM)-based cooperative transmissions because even small CFO per transmitter m...
147
click to vote
CONSTRAINTS
1998
15 years 1 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...