3889 search results - page 458 / 778 » A Framework for Optimizing Paper Matching |
180
click to vote
IJET
2006
15 years 6 months ago
2006
: The challenge of the semantic web is the provision of distributed information with well defined meaning, understandable for different parties. Particularly, applications should b...
170
click to vote
LISP
2008
15 years 6 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
157
click to vote
EOR
2007
15 years 6 months ago
2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
163
click to vote
ANOR
2005
15 years 6 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
147
click to vote
MP
2002
15 years 6 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...