1984 search results - page 122 / 397 » The colourful feasibility problem |
COCOON
2000
Springer
14 years 2 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
VTS
1995
IEEE
14 years 1 months ago
1995
IEEE
To ensure the production of reliable circuits and fully testable unpackaged dies for MCMs burn-in, both dynamic and monitored, remains a feasible option. During this burn-in proce...
AAAI
2006
13 years 11 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
AMC
2006
13 years 10 months ago
2006
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
INFOCOM
2012
IEEE
12 years 18 days ago
2012
IEEE
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...