Sciweavers

14386 search results - page 350 / 2878
» The Chinese Generals Problem
Sort
View
161
Voted
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
16 years 27 days ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
174
Voted
SIGMETRICS
2005
ACM
163views Hardware» more  SIGMETRICS 2005»
16 years 9 days ago
Smooth switching problem in buffered crossbar switches
Scalability considerations drive the switch fabric design to evolve from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, f...
Simin He, Shutao Sun, Wei Zhao, Yanfeng Zheng, Wen...
206
Voted
IEEEPACT
1998
IEEE
15 years 11 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
STRINGOLOGY
2008
15 years 8 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
AAAI
2006
15 years 8 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...