Sciweavers

2715 search results - page 266 / 543
» Total Generalized Variation
Sort
View
NETWORKS
2006
15 years 4 months ago
Black hole search in common interconnection networks
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 4 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
TCS
2008
15 years 4 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
ANOR
2004
79views more  ANOR 2004»
15 years 4 months ago
Preference-Based Search and Multi-Criteria Optimization
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
Ulrich Junker
BMCBI
2004
75views more  BMCBI 2004»
15 years 4 months ago
Structural characterization of genomes by large scale sequence-structure threading
Background: Using sequence-structure threading we have conducted structural characterization of complete proteomes of 37 archaeal, bacterial and eukaryotic organisms (including wo...
Artem Cherkasov, Steven J. M. Jones