1421 search results - page 64 / 285 » Satisfying KBO Constraints |
WG
2000
Springer
13 years 11 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
DASFAA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...