765 search results - page 99 / 153 » Empirical Design of Geometric Algorithms |
KDD
2008
ACM
16 years 7 days ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
SIGCSE
2006
ACM
15 years 5 months ago
2006
ACM
Plagiarism of material from the Internet is a widespread and growing problem. Computer science students, and those in other science and engineering courses, can sometimes get away...
ISPD
2003
ACM
15 years 5 months ago
2003
ACM
Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, and achieved i...
115
click to vote
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
110
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...