6455 search results - page 245 / 1291 » Research problems |
151
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
144
click to vote
ALENEX
2007
15 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
186
click to vote
CEC
2007
IEEE
16 years 27 days ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
169
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
A protein is identified by a finite sequence of aminoacids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting t...
141
click to vote
PERCOM
2008
ACM
16 years 6 months ago
2008
ACM
Service placement deals with the problem of selecting which node in a network is most suitable for hosting a service that responds to queries from other nodes. Optimally placing s...