7228 search results - page 753 / 1446 » From Algorithmic to Subjective Randomness |
231
click to vote
MOBIHOC
2002
ACM
16 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
187
click to vote
WSDM
2009
ACM
16 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
202
click to vote
LCTRTS
2009
Springer
16 years 2 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
188
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
195
click to vote
RTCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...