Sciweavers

4103 search results - page 35 / 821
» Some results on the Collatz problem
Sort
View
IJDMB
2010
128views more  IJDMB 2010»
13 years 4 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
OSN
2007
185views more  OSN 2007»
13 years 7 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 5 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
PVLDB
2010
110views more  PVLDB 2010»
13 years 5 months ago
Evaluation of entity resolution approaches on real-world match problems
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
Hanna Köpcke, Andreas Thor, Erhard Rahm
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 5 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia