3227 search results - page 346 / 646 » Designing with Distance Fields |
120
click to vote
COR
2007
15 years 4 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
114
click to vote
IPL
2006
15 years 4 months ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
121
click to vote
IS
2006
15 years 4 months ago
2006
As XML documents contain both content and structure information, taking advantage of the document structure in the retrieval process can lead to better identify relevant informati...
130
click to vote
ECCC
2007
15 years 4 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
136
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...