1984 search results - page 116 / 397 » The colourful feasibility problem |
DSN
2009
IEEE
14 years 4 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
ISCAS
1999
IEEE
14 years 2 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
AIPS
2006
13 years 11 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...