Sciweavers

36 search results - page 4 / 8
» Greedy Recommending Is Not Always Optimal
Sort
View
HIPC
2003
Springer
14 years 26 days ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
DAM
1998
77views more  DAM 1998»
13 years 7 months ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin
GIS
2007
ACM
13 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
ECBS
2007
IEEE
86views Hardware» more  ECBS 2007»
14 years 2 months ago
A Partitioning Analysis of the .NET Common Language Runtime
Microsoft's .NET platform was developed to simplify development of Windows applications. At the core of the .Net platform is a virtual machine known as the Common Language Ru...
Joshua R. Dick, Kenneth B. Kent, Joseph C. Libby
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 4 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu