Sciweavers

96 search results - page 1 / 20
» More on Configurations in Priestley Spaces, and Some New Pro...
Sort
View
ACS
2007
13 years 5 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
MASCOTS
2008
13 years 6 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
COORDINATION
2000
Springer
13 years 8 months ago
OpenSpaces: An Object-Oriented Framework for Reconfigurable Coordination Spaces
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
Stéphane Ducasse, Thomas Hofmann, Oscar Nie...
EVOW
2009
Springer
13 years 2 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
FPGA
2008
ACM
129views FPGA» more  FPGA 2008»
13 years 6 months ago
Efficient ASIP design for configurable processors with fine-grained resource sharing
Application-Specific Instruction-set Processors (ASIP) can improve execution speed by using custom instructions. Several ASIP design automation flows have been proposed recently. ...
Quang Dinh, Deming Chen, Martin D. F. Wong