Sciweavers

9477 search results - page 219 / 1896
» Design is as Easy as Optimization
Sort
View
CP
2005
Springer
16 years 4 days ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
BIRTE
2006
139views Business» more  BIRTE 2006»
15 years 10 months ago
Quality Contracts for Real-Time Enterprises
Real-time enterprises rely on user queries being answered in a timely fashion and using fresh data. This is relatively easy when systems are lightly loaded and both queries and upd...
Alexandros Labrinidis, Huiming Qu, Jie Xu
DCOSS
2008
Springer
15 years 8 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
DAC
2003
ACM
16 years 7 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
ICAISC
2004
Springer
15 years 12 months ago
Optimization of Centers' Positions for RBF Nets with Generalized Kernels
The problem of locating centers for radial basis functions in neural networks is discussed. The proposed approach allows us to apply the results from the theory of optimum experime...
Ewaryst Rafajlowicz, Miroslaw Pawlak