1964 search results - page 288 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
120
click to vote
CP
1995
Springer
15 years 6 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
153
click to vote
TIP
2002
15 years 2 months ago
2002
Abstract--Additive noise removal from a given signal is an important problem in signal processing. Among the most appealing aspects of this field are the ability to refer it to a w...
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
135
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
110
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— This paper addresses the topology control problem for large wireless networks that are modelled by an infinite point process on a two-dimensional plane. Topology control is th...