206 search results - page 19 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
70
Voted
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
UIST
2006
ACM
15 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
WINE
2009
Springer
15 years 2 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...