986 search results - page 172 / 198 » Generalized Goal Programming: polynomial methods and applica... |
102
click to vote
CACM
1998
14 years 11 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
119
click to vote
ICSE
2005
IEEE-ACM
15 years 12 months ago
2005
IEEE-ACM
Sensitive data are increasingly available on-line through the Web and other distributed protocols. This heightens the need to carefully control access to data. Control means not o...
102
click to vote
LCTRTS
2007
Springer
15 years 6 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
WWW
2007
ACM
16 years 14 days ago
2007
ACM
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
118
click to vote
ICALP
1993
Springer
15 years 3 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...