3019 search results - page 267 / 604 » Approximating the Domatic Number |
217
click to vote
COCOS
2003
Springer
15 years 11 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
193
click to vote
WSC
2007
15 years 8 months ago
2007
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
185
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
179
click to vote
COMCOM
2006
15 years 6 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
163
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...