Sciweavers

130 search results - page 6 / 26
» Using Higher Levels of Abstraction for Solving Optimization ...
Sort
View
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
Ahlem Ben Hassine, Tu Bao Ho
FUIN
2010
93views more  FUIN 2010»
13 years 6 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
ISLPED
2010
ACM
158views Hardware» more  ISLPED 2010»
13 years 7 months ago
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
Weixun Wang, Xiaoke Qin, Prabhat Mishra
ECCV
2008
Springer
14 years 9 months ago
Higher Dimensional Affine Registration and Vision Applications
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
Yu-Tseh Chi, S. M. Nejhum Shahed, Jeffrey Ho, Ming...
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 4 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...