14649 search results - page 358 / 2930 » Principles of problem solving |
248
click to vote
PATAT
2004
Springer
16 years 2 days ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
156
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
165
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
178
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
164
Voted
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...