Sciweavers

3600 search results - page 601 / 720
» The settling-time reducibility ordering
Sort
View
CSCLP
2008
Springer
15 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ICVGIP
2008
15 years 8 months ago
Algebraic Splats Representation for Point Based Models
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
Naveen Kumar Bolla, P. J. Narayanan
CAINE
2006
15 years 7 months ago
A multiobjective evolutionary approach for constrained joint source code optimization
The synergy of software and hardware leads to efficient application expression profile (AEP) not only in terms of execution time and energy but also optimal architecture usage. We...
Naeem Zafar Azeemi
FAST
2004
15 years 7 months ago
Circus: Opportunistic Block Reordering for Scalable Content Servers
Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement given the rapid growth in disk density, ...
Stergios V. Anastasiadis, Rajiv Wickremesinghe, Je...
IJCAI
1989
15 years 7 months ago
Layering Predictions: Flexible Use of Dialog Expectation in Speech Recognition
entional user behavior, we need a principled mannerAbstract for relaxing contextual constraints when they are violated.When computer speech recognition is used for problem In order...
Sheryl R. Young, Wayne H. Ward, Alexander G. Haupt...