Sciweavers

1921 search results - page 179 / 385
» The Student-Project Allocation Problem
Sort
View
CSCLP
2004
Springer
15 years 12 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
APSEC
2008
IEEE
16 years 29 days ago
Jackson's JSP-Like Method for State Transition Design
This paper presents an idea to apply Jackson’s JSP method, which is suitable for the transformation problem frame, into the state transition design, presented in the behavior pr...
Osamu Shigo
COCOA
2009
Springer
15 years 9 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
HPCC
2011
Springer
14 years 6 months ago
Achieving Performance and Availability Guarantees with Spot Instances
Abstract—In the Infrastructure-as-a-Service (IaaS) cloud computing market, spot instances refer to virtual servers that are rented via an auction. Spot instances allow IaaS provi...
Michele Mazzucco, Marlon Dumas
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 13 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner