2266 search results - page 129 / 454 » Some Solutions to the Ignoring Problem |
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
176
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
221
click to vote
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
With the growing acceptance of the Internet as a new dissemination medium, several new and interesting challenges arise in building a digital commerce infrastructure. In this arti...
140
click to vote
ISDA
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we address some open questions on the recently proposed Zero-Error Density Maximization algorithm for MLP training. We propose a new version of the cost function tha...
284
click to vote
ASP
2005
Springer
16 years 21 hour ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...