Sciweavers

3690 search results - page 369 / 738
» Computation with classical sequents
Sort
View
BMCBI
2006
72views more  BMCBI 2006»
15 years 7 months ago
Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in c
Background: Protein-protein interactions have traditionally been studied on a small scale, using classical biochemical methods to investigate the proteins of interest. More recent...
Pall F. Jonsson, Tamara Cavanna, Daniel Zicha, Pau...
CSJM
2006
76views more  CSJM 2006»
15 years 6 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
DAM
2006
78views more  DAM 2006»
15 years 6 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
EOR
2006
120views more  EOR 2006»
15 years 6 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
HEURISTICS
2006
95views more  HEURISTICS 2006»
15 years 6 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...