2899 search results - page 525 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
106
click to vote
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
108
click to vote
EDBT
2006
ACM
16 years 1 months ago
2006
ACM
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
109
click to vote
FPGA
2010
ACM
15 years 10 months ago
2010
ACM
Deep submicron processes have allowed FPGAs to grow in complexity and speed. However, such technology scaling has caused FPGAs to become more susceptible to the effects of process...
105
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
— This paper presents Tiji, a trajectory generation scheme, ie an algorithm that computes a feasible trajectory between a start and a goal state, for a given robotic system. Tiji...